منابع مشابه
Sets with many pairs of orthogonal vectors over finite fields
Let n be a positive integer and B be a non-degenerate symmetric bilinear form over Fq , where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possible size of a subset S of Fq such that |{B(x,y) |x,y ∈ S and x 6= y}| = 1. We also pose some conjectures concerning nearly orthogonal subsets of Fq where a nearly orthogonal subset T of Fq is a set of vect...
متن کاملLarge Sets of Nearly Orthogonal Vectors
It is shown that there is an absolute positive constant δ > 0, so that for all positive integers k and d, there are sets of at least d log2(k+2)/ log2 log2(k+2) nonzero vectors in R, in which any k+ 1 members contain an orthogonal pair. This settles a problem of Füredi and Stanley.
متن کاملArithmetic circuit classes over Zm
We continue the study of the complexity classes VP(Zm) and ΛP(Zm) which was initiated in [AGM15]. We distinguish between “strict” and “lax” versions of these classes and prove some new equalities and inclusions between these arithmetic circuit classes and various subclasses of ACC.
متن کاملInversion of Circulant Matrices over Zm
In this paper we consider the problem of inverting an n × n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Zm. We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their c...
متن کاملCYCLIC CODES AND THEIR DUALS OVER Zm
In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1970
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(70)80020-5